Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers
نویسندگان
چکیده
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a restricted form of multicast in which the destinations form a subcube. However, the broadcast routing algorithm adopted in the nCUBE-2 is not deadlock-free. In this paper, four multicast wormhole routing strategies for two-dimensional (2D) mesh multicomputers are proposed and studied. All of the algorithms are shown to be deadlock-free. These are the rst deadlock-free multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms under dynamic network traac conditions in a 2D mesh. The results indicate that a dual-path routing algorithm ooers performance advantages over tree-based, multi-path, and xed-path algorithms.
منابع مشابه
Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers Adaptive Multicast Wormhole Routing in 2d Mesh Multicomputers
The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially-adaptive, minimal fully-adaptive, and nonminimal adaptive routing. All the algorithms, which are the rst deadlock-free adaptive multicast wormhole routing algorithms ever proposed, are show...
متن کاملAdaptive Multicast Wormhole Routing in 2D Mesh Multicomputers
We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملPerformance Evaluation of Wormhole Routing in Octagonal Mesh Direct Networks
The octagonal mesh is a variation of the two-dimensional (2D) mesh topology in which each processing element is connected to its eight closest neighbors. This paper studies the octagonal mesh as a topology for a wormhole-routed multiprocessor. A unicast routing algorithm and two multicast routing algorithms are presented and shown to be deadlock-free. Simulation results are given that compare m...
متن کامل